Normalized Connectomes Show Increased Synchronizability with Age through Their Second Largest Eigenvalue

نویسندگان

چکیده

The synchronization of different brain regions is widely observed under both normal and pathological conditions, such as epilepsy. However, the relationship between dynamics these regions, connectivity them, ability to synchronize remains an open question. We investigate problem inter-region in networks Wilson--Cowan/neural field equations with homeostatic plasticity, each which acts a model for isolated region. consider arbitrary connection profiles only one constraint: rows matrices are all identically normalized. found that systems often solution obtained from single, self-coupled neural analyze stability this through straightforward modification master function (MSF) approach synchronized solutions lose when second largest positive eigenvalue sufficiently large values global coupling parameter not too large. This result was numerically confirmed ring lattices also robust small amounts heterogeneity set points node. Finally, we tested on connectomes 196 subjects over broad age range (4--85 years) Human Connectome Project. tended decrease age, indicating increase synchronizability may be related increased prevalence epilepsy advancing age.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graphs with small second largest Laplacian eigenvalue

Let L(G) be the Laplacian matrix of G. In this paper, we characterize all of the connected graphs with second largest Laplacian eigenvalue no more than l; where l . = 3.2470 is the largest root of the equation μ3 − 5μ2 + 6μ − 1 = 0. Moreover, this result is used to characterize all connected graphs with second largest Laplacian eigenvalue no more than three. © 2013 Elsevier Ltd. All rights rese...

متن کامل

A New Upper Bound on the Largest Normalized Laplacian Eigenvalue

Abstract. Let G be a simple undirected connected graph on n vertices. Suppose that the vertices of G are labelled 1,2, . . . ,n. Let di be the degree of the vertex i. The Randić matrix of G , denoted by R, is the n× n matrix whose (i, j)−entry is 1 √ did j if the vertices i and j are adjacent and 0 otherwise. The normalized Laplacian matrix of G is L = I−R, where I is the n× n identity matrix. ...

متن کامل

Spectral Characterization of Graphs with Small Second Largest Laplacian Eigenvalue

The family G of connected graphs with second largest Laplacian eigenvalue at most θ, where θ = 3.2470 is the largest root of the equation μ−5μ+6μ−1 = 0, is characterized by Wu, Yu and Shu [Y.R. Wu, G.L. Yu and J.L. Shu, Graphs with small second largest Laplacian eigenvalue, European J. Combin. 36 (2014) 190–197]. Let G(a, b, c, d) be a graph with order n = 2a + b + 2c + 3d + 1 that consists of ...

متن کامل

On the second largest eigenvalue of a mixed graph

Let G be a mixed graph. We discuss the relation between the second largest eigenvalue λ2(G) and the second largest degree d2(G), and present a sufficient condition for λ2(G) ≥ d2(G).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Siam Journal on Applied Dynamical Systems

سال: 2021

ISSN: ['1536-0040']

DOI: https://doi.org/10.1137/20m1370082